The Zero Duality Gap Property and Lower Semicontinuity of the Perturbation Function
نویسندگان
چکیده
We examine the validity of the zero duality gap properties for two important dual schemes: a generalized augmented Lagrangian dual scheme and a nonlinear Lagrangetype dual scheme. The necessary and sufficient conditions for the zero duality gap property to hold are established in terms of the lower semicontinuity of the perturbation functions.
منابع مشابه
Stable Zero Duality Gaps in Convex Programming: Complete Dual Characterisations with Applications to Semidefinite Programs∗
The zero duality gap that underpins the duality theory is one of the central ingredients in optimisation. In convex programming, it means that the optimal values of a given convex program and its associated dual program are equal. It allows, in particular, the development of efficient numerical schemes. However, the zero duality gap property does not always hold even for finite dimensional prob...
متن کاملLower semicontinuity for parametric set-valued vector equilibrium-like problems
A concept of weak $f$-property for a set-valued mapping is introduced, and then under some suitable assumptions, which do not involve any information about the solution set, the lower semicontinuity of the solution mapping to the parametric set-valued vector equilibrium-like problems are derived by using a density result and scalarization method, where the constraint set $K$...
متن کاملDecreasing Functions with Applications
The theory of increasing positively homogeneous functions deened on the positive orthant is applied to the class of decreasing functions. A multiplicative version of the inf-convolution operation is studied for decreasing functions. Modiied penalty functions for some constrained optimization problems are introduced which are in general nonlinear with respect to the objective function of the ori...
متن کاملAn Infinitesimal Approach for Analysis of Convex Optimization Problem with Duality Gap
We consider the problem of finding target vectors for which the nonzero duality gap exists in the problem of convex optimization. An infinitesimal approach to the duality gap analysis of convex problems is proposed. The approach is based on finding the order of smallness and the proportionality coefficient of perturbation function of the original optimization problem. We show that in case of du...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Oper. Res.
دوره 27 شماره
صفحات -
تاریخ انتشار 2002